Generalization of Some Determinantal Identities for Non-square Matrices Based on Radic’s Definition
نویسندگان
چکیده
In this paper, we focus on Radic’s definition for the determinant of non-square matrices. We develop some important properties of this determinant. We generalize several classical important determinant identities, including Dodgson’s condensation, Cauchy-Binet, and Trahan for non-square matrices. Also, we propose an efficient algorithm with Θ((mn)) time complexity for computing Radic’s determinant based on Dodgson algorithms and dynamic programming technique.
منابع مشابه
An efficient parallel algorithm for computing determinant of non square matrices
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time complexity of its algorithm. Among all definitions of determinant of rectangular matrices, Radic’s definition has special features which make it more notable. But in this definition, C(N M) sub matrices of the order m×m needed to be generated that put this problem in np-hard class. On the other ...
متن کاملGiambelli Compatible Point Processes
We distinguish a class of random point processes which we call Giambelli compatible point processes. Our definition was partly inspired by determinantal identities for averages of products and ratios of characteristic polynomials for random matrices found earlier by Fyodorov and Strahov. It is closely related to the classical Giambelli formula for Schur symmetric functions. We show that orthogo...
متن کاملA Preferred Definition of Conditional Rényi Entropy
The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...
متن کاملA New Method for Computing Determinants By Reducing The Orders By Two
In this paper we will present a new method to calculate determinants of square matrices. The method is based on the Chio-Dodgson's condensation formula and our approach automatically affects in reducing the order of determinants by two. Also, using the Chio's condensation method we present an inductive proof of Dodgson's determinantal identity.
متن کاملP D - Matrices and Linear Complementarity Problems
Motivated by the definition of P†-matrix ([9]), another generalization of a P -matrix for square singular matrices called PD-matrix is proposed first. Then the uniqueness of solution of Linear Complementarity Problems for square singular matrices is proved using PD-matrices. Finally some results which are true for P -matrices are extended to PD-matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010